منابع مشابه
Reading McDermott ✩ Varol Akman
The author is interested in computational approaches to consciousness. His reason for working in the field of AI is to solve the mind-body problem, that is, to understand how the brain can have experiences. This is an intricate project because it involves elucidation of the relationship between our mentality and its physical foundation. How can a biological/chemical system (the human body) have...
متن کاملC E N T E R F O R R E S E a R C H I N L a N G U a G E
A 3-layer back propagation network is used to implement a pattern association task which learns mappings that are analogous to the present and past tense forms of English verbs, i.e., arbitrary, identity, vowel change, and suffixation mappings. The degree of correspondence between connectionist models of tasks of this type (Rumelhart & McClelland, 1986; 1987) and children’s acquisition of infle...
متن کامل[McDermott, 1988] J. McDermott. Preliminary steps towards a taxonomy of problemsolving methods. In S. Marcus, editor,
Organizing PSM into a some library for reuse reveals two related problems that have thus far received little explicit attention: What is the scope of reuse of a PSM? How distinctive/similar are PSM? In considering the first question, the working hypothesis in constructing such libraries, and in particular the CommonKADS library, has been that PSM are task specific, and that therefore the major ...
متن کاملV E R
Managing the buffering of data along arcs is a critical part of compiling a synchronous dataflow (SDF) program. This paper shows how dataflow properties can be analyzed at compile-time to make buffering more efficient. Since the target code corresponding to each node of an SDF graph is normally obtained from a hand-optimized library of predefined blocks, the efficiency of data transfer between ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Political Economy
سال: 1904
ISSN: 0022-3808,1537-534X
DOI: 10.1086/251096